P−ferrer Diagram, P−linear Ideals and Arithmetical Rank
نویسنده
چکیده
In this paper we introduce p−Ferrer diagram, note that 1− Ferrer diagram are the usual Ferrer diagrams or Ferrer board, and corresponds to planar partitions. To any p−Ferrer diagram we associate a p−Ferrer ideal. We prove that p−Ferrer ideal have Castelnuovo mumford regularity p + 1. We also study Betti numbers , minimal resolutions of p−Ferrer ideals. Every p−Ferrer ideal is p−joined ideals in a sense defined in a fortcoming paper [M], which extends the notion of linearly joined ideals introduced and developped in the papers [BM2], [BM4],[EGHP] and [M]. We can observe the connection between the results on this paper about the Poincaré series of a p−Ferrer diagram Φand the rook problem, which consist to put k rooks in a non attacking position on the p−Ferrer diagram Φ.
منابع مشابه
Equations of 2-linear Ideals and Arithmetical Rank
1 In this paper we consider reduced homogeneous ideals J ⊂ S of a polynomial ring S, having a 2-linear resolution. 1. We study systems of generators of J ⊂ S. 2. We compute the arithmetical rank for a large class of projective curves having a 2-linear resolution. 3. We show that the fiber cone projF(IL) of a lattice ideal IL of codimension two is a set theoretical complete intersection.
متن کاملOn the arithmetical rank of the edge ideals of forests
We show that for the edge ideals of a certain class of forests, the arithmetical rank equals the projective dimension.
متن کاملOn the arithmetical rank of an intersection of ideals
We determine sets of elements which, under certain conditions, generate an intersection of ideals up to radical.
متن کاملArithmetical Rank of Toric Ideals Associated to Graphs
Let IG ⊂ K[x1, . . . , xm] be the toric ideal associated to a finite graph G. In this paper we study the binomial arithmetical rank and the Ghomogeneous arithmetical rank of IG in 2 cases: (1) G is bipartite, (2) IG is generated by quadratic binomials. In both cases we prove that the binomial arithmetical rank and the G-arithmetical rank coincide with the minimal number of generators of IG.
متن کاملMatchings in simplicial complexes, circuits and toric varieties
Using a generalized notion of matching in a simplicial complex and circuits of vector configurations, we compute lower bounds for the minimum number of generators, the binomial arithmetical rank and the A-homogeneous arithmetical rank of a lattice ideal. Prime lattice ideals are toric ideals, i.e. the defining ideals of toric varieties. © 2006 Elsevier Inc. All rights reserved.
متن کامل